A note on the generalized min-sum set cover problem
نویسندگان
چکیده
In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin [1]. Bansal, Gupta, and Krishnaswamy [2] give a 485approximation algorithm for the problem. We are able to alter their algorithm and analysis to obtain a 28-approximation algorithm, improving the performance guarantee by an order of magnitude. We use concepts from α-point scheduling to obtain our improvements.
منابع مشابه
Min-Sum Set Cover and Its Generalizations
Min Sum Set Cover and its Generalizations Name: Sungjin Im Affil./Addr. Electrical Engineering and Computer Science, University of California, Merced, CA, USA
متن کاملApproximating Minimum Linear Ordering Problems
This paper addresses the Minimum Linear Ordering Problem (MLOP): Given a nonnegative set function f on a finite set V , find a linear ordering on V such that the sum of the function values for all the suffixes is minimized. This problem generalizes well-known problems such as the Minimum Linear Arrangement, Min Sum Set Cover, Minimum Latency Set Cover, and Multiple Intents Ranking. Extending a ...
متن کاملResults on the min-sum vertex cover problem
Let G be a graph with the vertex set V (G), edge set E(G). A vertex labeling is a bijection f : V (G)→ {1, 2, . . . , |V (G)|}. The weight of e = uv ∈ E(G) is given by g(e) = min{f(u), f(v)}. The min-sum vertex cover (msvc) is a vertex labeling that minimizes the vertex cover number μs(G) = ∑ e∈E(G) g(e). The minimum such sum is called the msvc cost. In this paper, we give both general bounds a...
متن کاملPreemptive and Non-Preemptive Generalized Min Sum Set Cover
In the (non-preemptive) Generalized Min Sum Set Cover Problem, we are given n ground elements and a collection of sets S = {S1, S2, ..., Sm} where each set Si ∈ 2 has a positive requirement κ(Si) that has to be fulfilled. We would like to order all elements to minimize the total (weighted) cover time of all sets. The cover time of a set Si is defined as the first index j in the ordering such th...
متن کاملThe Generalized Subgraph Problem: Complexity, Approximability and Polyhedra
This paper is concerned with a problem on networks which we call the Generalized Subgraph Problem (GSP). The GSP is defined on an undirected graph where the vertex set is partitioned into clusters. The task is to find a subgraph which touches at most one vertex in each cluster so as to maximize the sum of vertex and edge weights. The GSP is a relaxation of several important problems of a ‘gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 39 شماره
صفحات -
تاریخ انتشار 2011